The Horn Recursion for Schur P - and Q - Functions : Extended
نویسنده
چکیده
A consequence of work of Klyachko and of Knutson-Tao is the Horn recursion to determine when a Littlewood-Richardson coefficient is non-zero. Briefly, a LittlewoodRichardson coefficient is non-zero if and only if it satisfies a collection of Horn inequalities which are indexed by smaller non-zero Littlewood-Richardson coefficients. There are similar Littlewood-Richardson numbers for Schur P and Qfunctions. Using a mixture of combinatorics of root systems, combinatorial linear algebra in Lie algebras, and the geometry of certain cominuscule flag varieties, we give Horn recursions to determine when these other Littlewood-Richardson numbers are non-zero. Our inequalities come from the usual Littlewood-Richardson numbers, and while we give two very different Horn recursions, they have the same sets of solutions. Another combinatorial by-product of this work is a new Horn-type recursion for the usual Littlewood-Richardson coefficients.
منابع مشابه
M ar 2 00 6 THE HORN RECURSION FOR SCHUR P - AND Q - FUNCTIONS : EXTENDED ABSTRACT
A consequence of work of Klyachko and of Knutson-Tao is the Horn recursion to determine when a Littlewood-Richardson coefficient is non-zero. Briefly, a LittlewoodRichardson coefficient is non-zero if and only if it satisfies a collection of Horn inequalities which are indexed by smaller non-zero Littlewood-Richardson coefficients. There are similar Littlewood-Richardson numbers for Schur P and...
متن کاملPfaffians and Determinants for Schur Q-Functions
Schur Q-functions were originally introduced by Schur in relation to projective representations of the symmetric group and they can be defined combinatorially in terms of shifted tableaux. In this paper we describe planar decompositions of shifted tableaux into strips and use the shapes of these strips to generate pfaffi.ans and determinants that are equal to Schur Q-functions. As special cases...
متن کاملA recursion formula for k-Schur functions
The Bernstein operators allow to build recursively the Schur functions. We present a recursion formula for k-Schur functions at t = 1 based on combinatorial operators that generalize the Bernstein operators. The recursion leads immediately to a combinatorial interpretation for the expansion coefficients of k-Schur functions at t = 1 in terms of homogeneous symmetric functions.
متن کاملOn Constructing Matrices with Prescribed Singular Values and Diagonal Elements
Similar to the well known Schur Horn theorem that characterizes the relationship between the diagonal entries and the eigenvalues of a Hermitian matrix the Sing Thompson theorem characterizes the relationship between the diagonal en tries and the singular values of an arbitrary matrix It is noted in this paper that based on the induction principle such a matrix can be constructed numerically by...
متن کاملCombinatorics of Ribbon Tableaux
This thesis begins with the study of a class of symmetric functions {x} which are generating functions for ribbon tableaux (hereon called ribbon functions), first defined by Lascoux, Leclerc and Thibon. Following work of Fomin and Greene, I introduce a set of operators called ribbon Schur operators on the space of partitions. I develop the theory of ribbon functions using these operators in an ...
متن کامل